Unsupervised learning algorithms applied to grouping problems
نویسندگان
چکیده
منابع مشابه
Fuzzy-evolutionary Algorithms Applied to Scheduling Problems
In this work, we will address three sequencing problems: Single Machine, Parallel Machine and Flowshop scheduling. The three problems were studied in previous contributions via approaches based on Memetic Algorithms (MAs). For this work, the original MAs were upgraded with the inclusion of an online running controller based on fuzzy logic for the previously fixed parameters of the evolutionary ...
متن کاملCategorizing Unsupervised Relational Learning Algorithms
We outline some criteria by which to compare unsupervised relational learning algorithms, and illustrate these criteria with reference to three examples: SUBDUE, relational association rules (WARMR), and Probabilistic Relational Models. For each algorithm we ask, What form of input data does it require? What form of output does it produce? Can the output be used to make predictions about unseen...
متن کاملExplanations of unsupervised learning clustering applied to data security analysis
Network security tests should be periodically conducted to detect vulnerabilities before they are exploited. However, analysis of testing results is resource intensive with many data and requires expertise because it is an unsupervised domain. This paper presents how to automate and improve this analysis through the identification and explanation of device groups with similar vulnerabilities. C...
متن کاملUsing GPUs to speedup sparse coding algorithms applied to self-taught learning problems
In this work, we present a new combination of sparse coding algorithms designed to exploit the GPU and apply it to a self-taught learning [1] problem. We build on top of the iterative approach of solving two convex optimization problems alternatingly (originally suggested in [2]). The first and most important improvement in this work is a parallelized coordinate descent algorithm for the genera...
متن کاملUnsupervised learning applied to progressive compression of time-dependent geometry
We propose a new approach to progressively compress time-dependent geometry. Our approach exploits correlations in motion vectors to achieve better compression. We use unsupervised learning techniques to detect good clusters of motion vectors. For each detected cluster, we build a hierarchy of motion vectors using pairwise agglomerative clustering, and succinctly encode the hierarchy using entr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2020
ISSN: 1877-0509
DOI: 10.1016/j.procs.2020.07.099